Detecting Road Intersections from GPS Traces Using Longest Common Subsequence Algorithm
نویسندگان
چکیده
منابع مشابه
Detecting Road Intersections from GPS Traces Using Longest Common Subsequence Algorithm
Xingzhe Xie 1,*, Wenzhi Liao 1, Hamid Aghajan 1,2, Peter Veelaert 1 and Wilfried Philips 1 1 imec-IPI-UGent, Ghent University, Sint-Pietersnieuwstraat 41, 9000 Ghent, Belgium; [email protected] (W.L.); [email protected] (H.A.); [email protected] (P.V.); [email protected] (W.P.) 2 Ambient Intelligence Research (AIR) Lab, Department of Electrical Engineering, Stanford Uni...
متن کاملDetecting Road Intersections from GPS Traces
As an alternative to expensive road surveys, we are working toward a method to infer the road network from GPS data logged from regular vehicles. One of the most important components of this problem is to find road intersections. We introduce an intersection detector that uses a localized shape descriptor to represent the distribution of GPS traces around a point. A classifier is trained on the...
متن کاملDetecting Road Intersections from Coarse-gained GPS Traces Based on Clustering
SPECIAL ISSUE PAPERS UWB-based Receiver Initiated MAC Protocol with Packet Aggregation and Selective Retransmission Dongsheng Ning, Xiaoyan Xu, Yanping Yu, Xinxin Liu, and Xiaoyan Wang A Novel Trust Evaluation Model Based on Gray Clustering Theory for Routing Networks Ting Han, Shoushan Luo, Hongliang Zhu, Yang Xin, and Yong Peng A Robust and Efficient Clustering Algorithm for Network MIMO Syst...
متن کاملParallel Longest Common Subsequence using Graphics Hardware
We present an algorithm for solving the Longest Common Subsequence problem using graphics hardware acceleration. We identify a parallel memory access pattern which enables us to run efficiently on multiple layers of parallel hardware by matching each layer to the best sub-algorithm, which is determined using a mix of theoretical and experimental data including knowledge of the specific hardware...
متن کاملLongest Common Subsequence from Fragmentsvia Sparse Dynamic
Sparse Dynamic Programming has emerged as an essential tool for the design of eecient algorithms for optimization problems coming from such diverse areas as Computer Science, Computational Biology and Speech Recognition 7, 11, 15]. We provide a new Sparse Dynamic Programming technique that extends the Hunt-Szymanski 2, 9, 8] paradigm for the computation of the Longest Common Subsequence (LCS) a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISPRS International Journal of Geo-Information
سال: 2016
ISSN: 2220-9964
DOI: 10.3390/ijgi6010001